Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation

نویسندگان

  • Arthur D. Chtcherba
  • Deepak Kapur
چکیده

A necessary and sufficient condition on the support of a generic unmixed bivariate polynomial system is identified such that for polynomial systems with such support, the Dixon resultant formulation produces their resultants. It is shown that Sylvester-type matrices, called Dixon dialytic matrices, can also be obtained for such polynomial systems. These results are shown to be a generalization of related results reported by Chionh as well as Zhang and Goldman. For a support not satisfying the above condition, the degree of the extraneous factor in the projection operator computed by the Dixon formulation is calculated by analyzing how much the support deviates from a related rectangular support satisfying the condition. This degree estimate is an upper bound on the degree of the extraneous factor in the case when the polynomial system with a given unmixed support is generic. The concept of a support hull interior point of a support is introduced. A generic inclusion of terms corresponding to support hull interior points in an unmixed polynomial system is shown not to affect the degree of the projection operator computed by the Dixon construction. It is shown that the proposed construction for Dixon dialytic matrices works especially well for mixed bivariate systems. “Good” Sylvester-type matrices can be constructed by solving an optimization problem on their supports (by translating supports so that they have maximal overlap). The determinant of such a matrix gives a projection operator with a low degree extraneous factor, i.e. the degree of the extraneous factor in a projection operator computed from the original polynomial system is at least as much as the degree of the extraneous factor in a projection operator computed from the corresponding “translated” polynomial system. The results are illustrated on a variety of examples. © 2004 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation

Structural conditions on the support of a multivariate polynomial system are developed for which the Dixon-based resultant methods compute exact resultants. For cases when this cannot be done, an upper bound on the degree of the extraneous factor in the projection operator can be determined a priori, thus resulting in quick identification of the extraneous factor in the projection operator. (Fo...

متن کامل

A Complete Analysis of Resultants and Extraneous Factors for Unmixed Bivariate Polynomial Systems using the Dixon formulation

A necessary and sufficient condition on the support of a generic unmixed bivariate polynomial system is identified such that for polynomial systems with such support, the Dixon resultant formulation produces their resultants. It is shown that Sylvester-type matrices can also be obtained for such polynomial systems. These results are shown to be a generalization of related results recently repor...

متن کامل

Resultants for Unmixed Bivariate Polynomial Systems using the Dixon formulation

A necessary and sufficient condition on the support of a generic unmixed bivariate polynomial system is identified such that for polynomial systems with such support, the Dixon resultant formulation produces their resultants. It is shown that Sylvester-type matrices can also be obtained for such polynomial systems. These results are shown to be a generalization of related results recently repor...

متن کامل

Acm Symposium on Theory of Computing (stoc 96) Sparsity Considerations in Dixon Resultants

New results relating the sparsity of nonhomogeneous polynomial systems and computation of their projection operator (a non-trivial multiple of the multivariate resultant) using Dixon's method are developed. It is demonstrated that Dixon's method of computing resultants, despite being classical, implicitly exploits the sparse structure of input polynomials. It is proved that the size of the Dixo...

متن کامل

Cayley-Dixon construction of Resultants of Multi-Univariate Composed Polynomials

The Cayley-Dixon formulation for multivariate resultants have been shown to be efficient (both experimentally and theoretically) for computing resultants by simultaneously eliminating many variables from a polynomial system. In this paper, the behavior of Cayley-Dixon resultant construction and the structure of Dixon matrices is analyzed for composed polynomial systems constructed from a multiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2004